Project Scheduling: The Impact of Instance Structure on Heuristic Performance

نویسنده

  • Frits de Nijs
چکیده

Many meta-heuristic approaches have been suggested for or applied to the Resource Constrained Project Scheduling Problem (RCPSP). The existence of a number of highly accessible standard benchmark sets has promoted a research focus on finding anything that improves average solution quality, without investigating what effect is responsible for the improvement, or what is responsible for holding us back. This work focuses instead on understanding the original constructive Schedule Generation heuristics and their interaction with a well known but poorly understood post-processing step called Forward-Backward Improvement that is known to almost always improve any generated RCPSP schedule. We follow an empirical investigation methodology by first observing the effect of FBI on a large generated testset. Based on these observations we explain why FBI works by means of hypotheses on its operation. These hypotheses generate predictions that we subsequently successfully test in a second round of experiments. In the process we are able to propose a novel priority rule heuristic based on the principles of FBI. We find that this new rule outperforms the current best priority rule heuristic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Project scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study

Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...

متن کامل

Detecting communities of workforces for the multi-skill resource-constrained project scheduling problem: A dandelion solution approach

This paper proposes a new mixed-integer model for the multi-skill resource-constrained project scheduling problem (MSRCPSP). The interactions between workers are represented as undirected networks. Therefore, for each required skill, an undirected network is formed which shows the relations of human resources. In this paper, community detection in networks is used to find the most compatible wo...

متن کامل

Resource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)

Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...

متن کامل

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

Uncertain Resource Availabilities: Proactive and Reactive Procedures for Preemptive Resource Constrained project Scheduling Problem

Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013